Fitted BVH for Fast Raytracing of Metaballs

نویسندگان

  • Olivier Gourmel
  • Anthony Pajot
  • Mathias Paulin
  • Loïc Barthe
  • Pierre Poulin
چکیده

Raytracing metaballs is a problem that has numerous applications in the rendering of dynamic soft objects such as fluids. However, current techniques are either limited in the visual effects that they can render or their performance drops as the number of metaballs and their density increase. We present a new acceleration structure based on BVH and kd-tree for efficient raytracing of a large number of metaballs. This structure is built from an adapted SAH using a fast greedy algorithm and allows the visualization of several hundreds of thousands metaballs at interactive-to-real-time framerates. Our method can handle arbitrary rays to simulate any complex secondary effects such as reflections or soft shadows, and is robust with respect to the density of metaballs. We achieve this performance thanks to a balanced CPU-GPU (using CUDA) implementation of the animation, structure creation, and rendering.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Thickness computation of trimmed B-Rep model sing GPU ray tracing

This paper demonstrates the use of direct ray tracing of large industrial CAD models on the GPU. The ray tracing kernel is a building block used to compute and assess the validity of the mechanical design of CAD models. A high precision and efficient solution to handle trimmed surfaces with holes is discussed. The central idea leverages Bézier curve properties to build a fast, robust and stable...

متن کامل

Memory-Conserving Bounding Volume Hierarchies with Coherent Raytracing

Bounding volume hierarchies (BVH) are a commonly-used method for speeding up ray tracing, but they can consume a large amount of memory for complex scenes. We present a new scheme for storing BVHs that reduces the storage requirements by up to 79%. This scheme has significant computational overhead, but this can be reduced to negligible levels by shooting bundles of rays through the BVH (cohere...

متن کامل

GPU-based Fast Ray Casting for a Large Number of Metaballs

Metaballs are implicit surfaces widely used to model curved objects, represented by the isosurface of a density field defined by a set of points. Recently, the results of particle-based simulations have been often visualized using a large number of metaballs, however, such visualizations have high rendering costs. In this paper we propose a fast technique for rendering metaballs on the GPU. Ins...

متن کامل

Interactive and Scalable Ray-Casting of Metaballs on the GPU

Metaballs are a useful technique to model blobby surfaces. Because metaballs define an implicit surface, rendering is difficult. We seek to render the surface directly via ray-casting, to precisely locate the isosurfaces and preserve the concise representation of the surface. To perform this rendering at interactive rates on dynamic data, we will use acceleration structures for fast surface cal...

متن کامل

An Improved Multi-Level Raytracing Algorithm

Previous work has used entry point search (EP search) to accelerate raytracing by avoiding redundant traversal of nodes in a KD tree. EP search works by identifying a node which may be used as a starting point for tracing a particular group of coherent rays, thus bypassing all nodes above it. This is most effective when all rays can be shown to be occluded, since a leaf or low inner node can of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2010